Analog nature of quantum adiabatic unstructured search
نویسندگان
چکیده
منابع مشابه
Quantum search by local adiabatic evolution
The adiabatic theorem has been recently used to design quantum algorithms of a new kind, where the quantum computer evolves slowly enough so that it remains near its instantaneous ground state, which tends to the solution. We apply this time-dependent Hamiltonian approach to Grover’s problem, i.e., searching a marked item in an unstructured database. We find that by adjusting the evolution rate...
متن کاملAdiabatic quantum search algorithm for structured problems
The study of quantum computation has been motivated by the hope of finding efficient quantum algorithms for solving classically hard problems. In this context, quantum algorithms by local adiabatic evolution have been shown to solve an unstructured search problem with a quadratic speedup over a classical search, just as Grover’s algorithm. In this paper, we study how the structure of the search...
متن کاملQuantum search by partial adiabatic evolution
Quantum adiabatic computation has attracted a lot of attention in the past decades, such as [1, 3–10], since it was proposed by Farhi et al.[11]. In [5], an adiabatic algorithm was proposed to solve the Deutsch-Jozsa problem. The algorithm took an exponential time which provided only a quadratic speed up over the best classical algorithm for the problem. A modified algorithm proposed by Wei and...
متن کاملAdiabatic quantum algorithm for search engine ranking.
We propose an adiabatic quantum algorithm for generating a quantum pure state encoding of the PageRank vector, the most widely used tool in ranking the relative importance of internet pages. We present extensive numerical simulations which provide evidence that this algorithm can prepare the quantum PageRank state in a time which, on average, scales polylogarithmically in the number of web page...
متن کاملLocal adiabatic quantum search with different paths
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path via a ’sure success’ Hamiltonian is introduced and is shown that the time required to find an item in a database of size N can be made to be almost independent of the size of the dat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: New Journal of Physics
سال: 2019
ISSN: 1367-2630
DOI: 10.1088/1367-2630/ab51f9